Reliable elliptic curve cryptography computation

ABSTRACT

A method for reliable computation of point additions and point multiplications in an elliptic curve cryptography (ECC) system. Two asymmetric operations are performed: one of the operations is of slightly higher complexity than a conventional ECC operation, and the other operation is of much lower complexity than the first operation. The complexity of the second operation is a function of the desired degree of reliability, or the desired probability of failure detection. The method validates a computation involving one or more points on a specified elliptic curve by selecting a second elliptic curve, deriving a third elliptic curve from the specified and selected curves, projecting points onto the derived curve, performing a computation on the derived curve involving the projected points, validating the computation on the selected curve, extracting from the computation on the derived curve a predicted result of the computation on the selected curve, and comparing the predicted result to the computation on the selected curve. A predicted result of the computation to be validated may then be extracted from the computation on the derived curve. The predicted result is compared to an actual result of a computation on the selected curve, and if the results match, the predicted result of the computation performed on the selected curve is validated.

This application claims the benefit of U.S. Provisional Application No. 60/604,079 filed Aug. 24, 2004.

BACKGROUND OF THE INVENTION

1. Field of the Invention

This invention relates generally to the field of elliptic curve cryptography, and more specifically, to elliptic curve point computation reliability.

2. Background

Cryptography systems based on elliptic curves are well known in the art. Elliptic curve cryptography (ECC) is widely used today as a method for encoding data to prevent unauthorized access to information that is stored or transmitted electronically. Increasingly, ECC systems are being used in data communications systems to ensure privacy, to authenticate transmissions, and to maintain data integrity.

Encryption in ECC systems involves finding a solution to the discrete logarithm problem from the group of points of an elliptic curve defined over a finite field. Using additive notation, this problem can be described as: given points P and Q in the group, find a number k such that kP=Q. Additional background on elliptic curves, and on mathematical operations performed on elliptic curves, is provided below.

Elliptic Curve Defined Over a Field

An elliptic curve E_(p) over a field F_(p), where p is a prime greater than three, is composed by the set of points (x,y) that satisfy an elliptic curve equation such as y²≡x³+a_(p)x+b_(p) mod p together with the point at infinity O_(p). The addition of points belonging to E_(p) that involves the point at infinity are the following: O_(p)+O_(p)=O_(p), P+O_(p)=O_(p)+P=P, P+(−P)=(−P)+P=O_(p). Equation (1) defines an expression for the point addition operation P₁+P₂ for which P₁≠O_(p), P₂≠O_(p), and P₁+P₂≠O_(p). λ_(p)≡(y ₂ −y ₁)/(x ₂ −x ₁)mod p for P₁≠P₂ or (3x ₁ ² +a _(p))/(2y ₁)mod p for P₁=P₂ x ₃≡λ_(p) ² −x ₁ −x ₂ mod p y ₃≡λ_(p)(x ₁ −x ₃)−y ₁ mod p  (1)

The points on E_(p) define a commutative group under the point addition operation defined above. The number of points in the curve is denoted here by #E_(p). #E_(p) is also referred to as the order of the curve. The order of a point P is the scalar number n_(p) for which n_(p)P=O_(p). kP, where k is a scalar and P is a point on the curve, represents the addition of k points P (kP=P+P+ . . . +P). This operation, known as point multiplication, may be computed with iterated point additions.

Industry standards such as FIPS 186-2 (“Digital Signature Standard (DSS),” Federal Information Processing Standards Publication 186-2, U.S. Dept. of Commerce/NIST, January 2000), incorporated herein by reference, recommend the use of curves of prime orders in cryptography systems. In certain cases, subgroups of prime orders may also be used. For these curves and groups, the order of each point of interest with the exception of O_(p) is the same. Using a group of prime order also guarantees that each point with the exception of O_(p) is a generator of the group. Different multiples of a generator point define all the points in a group; for example, given that P is a generator, all the elements of the group correspond to the multiples iP where i=0 to n_(p)−1, where n_(p) represents the order of each point except O_(p).

Elliptic Curve Defined Over a Ring

An elliptic curve E_(n) over a ring Z_(n) is composed by the set of points (x,y) that satisfy an elliptic curve equation such as y²≡x³+a_(n)x+b_(n) mod n together with the point at infinity O_(n).

The well-known Chinese Remainder Theorem (CRT) allows the representation of point P=(x,y)∈E_(n) as follows: P=[P_(p), P_(q)]=[(x_(p), y_(p)), (x_(q), y_(q))], where P_(p)∈E_(p), P_(q)∈E_(q), x_(p)≡x mod p, x_(q)≡x mod q, y_(p)≡y mod p, and y_(q)≡y mod q. E_(p) and E_(q) are elliptic curves defined over fields F_(p) and F_(q). O_(p) and O_(q) represent the points at infinity in E_(p) and E_(q), and by convention O_(n)=[O_(p), O_(q)]. The constants in the curve expression for E_(n) are related to the constants on the expressions for the curves E_(p) and E_(q) in the following way: a_(n)=[a_(p), a_(q)] and b_(n)=[b_(p), b_(q)], where a_(p)≡a_(n) mod p, a_(q)≡a_(n) mod q , b_(p)≡b_(n) mod p, and b_(q)≡b_(n) mod q. Throughout this disclosure, expressions inside brackets represent the projections modulo p and modulo q. The expression modulo n can be computed from the expressions modulo p and modulo q using Gauss's or Garner's algorithms. Descriptions of these algorithms are well known in the art, and can be found, e.g. in A. J. Menezes et al., “Handbook of Applied Cryptography,” CRC Press, 1997 (hereinafter “Menezes”), available at www.cacr.math.uwaterloo.ca/hac, and incorporated herein by reference.

The addition of points belonging to E_(n) can be defined so it is analogous to the addition of points belonging to curves defined over finite fields. The basic operations involving the point at infinity are the following: O_(n)+O_(n)=O_(n), P+O_(n)=O_(n)+P=P, P+(−P)=(−P)+P=O_(n). The addition P₁+P₂, where P₁=[P_(1p), P_(1q)] and P₂=[P_(2p), P_(2q)], can be computed according to Equation (2) given the following restrictions in addition to those shown in the equation: P_(1p)≠O_(p). P_(1q)≠O_(q), P_(2p)≠O_(p), P_(2q)≠O_(q), P_(1p)+P_(2p)≠O_(p) in E_(p), and P_(1q)+P_(2q)≠O_(q) in E_(q).

The additional restrictions in Equation (2) establish consistent operations in E_(p), E_(q), and E_(n). In this equation and throughout this disclosure, the symbol /≡ represents a non-congruent condition. A point addition where P₁≠P₂ corresponds to a point addition in E_(p) where P_(1p)≠P_(2p) and to a point addition in E_(q) where P_(1q)≠P_(2q). The restrictions may not allow, for example, a point addition in E_(n) to correspond to a point addition in E_(p) (P_(1p)≠P_(2p)) and to a point double in E_(q) (P_(1q)=P_(2q)). The stated conditions guarantee the existence of the inverses (x₂−x₁)⁻¹=[(x_(2p)−x_(1p))⁻¹, (x_(2q)−x_(1q))⁻¹] and (2y₁)¹=[(2y_(1p))⁻¹, (2y_(1q))⁻¹] and their computation either directly or using the CRT. Given the inverses relationships, one can verify the following relationships: λ_(n)=[λ_(p), λ_(q)], x₃=[x_(3p),x_(3q)], and y₃=[y_(3p),y_(3q)]. λ_(n)≡(y ₂ −y ₁)(x ₂ −x ₁)mod n for x₁/≡x₂ mod p and x₁/≡x₂ mod q or (3x ₁ ² +a _(n))/(2y ₁)mod n for x₁≡x₂ mod p and x₁≡x₂ mod q x ₃≡λ_(n) ² −x ₁ −x ₂ mod n y ₃≡λ_(n)(x ₁ −x ₃)−y ₁ mod n  (2)

Equation (2) restricts the points in E_(n) that can be added. The following sections demonstrate how point addition and point multiplication operations can be performed using point addition in a ring in a way that avoids restricted point additions.

Point Multiplication

For large elliptic curves, point multiplications are computed with iterated point doubles and additions. Algorithm 1 (below) shows the double and add point multiplication algorithm, which is one of the simplest point multiplication algorithms. In Algorithm 1, step 2.1.1 uses a point double and step 2.1.2.1 uses a point addition.

For curves defined over finite fields, the expressions in Equation (1) can be used to compute these operations when Q≠O, P≠O, and P+Q≠O. For curves defined over rings, Algorithm 1 may be modified to comply with the restrictions described above for elliptic curves defined over a ring. Note that in general, a point multiplication is computed with iterated point additions and point doubles.

Point multiplication typically involves the computation of many point doubles and point additions (or point subtractions). When using affine coordinates in point double and point addition operations, inverse operations can be very costly in terms of processing time and memory usage. These inverse operations can be avoided by using projective coordinates. When using projective coordinates, the point double and the point addition operations require a larger number of multiplications and additions than when using affine coordinates but they do not require the computation of inverses. One inverse is required at the end of a point multiplication, when the resulting point is converted back to affine coordinates. Depending on the algorithm and the target performance, one or more additional inverses may be required to represent pre-computed points in affine coordinates.

Point multiplication when using projective coordinates typically involves the following steps: 1) conversion from affine coordinates, P=(x,y), to projective coordinates, P=(X,Y,Z); 2) computation of point multiplication Q=kP=k(X,Y,Z) using classical algorithms but with the point operations done in projective coordinates; and 3) conversion of the resulting point Q=(X,Y,Z) to affine coordinates Q=(x,y). Point multiplication algorithms are well known in the art and in industry standards. Additional examples can be found in G. Orlando, “Efficient Elliptic Curve Processor Architectures for Field Programmable Logic,” Ph.D. dissertation, ECE Dept., Worcester Polytechnic Institute, Worcester, Mass., March 2002, incorporated herein by reference.

Two projective coordinates representations, known as homogeneous coordinates and Jacobian coordinates, are described below. To highlight operations on curves defined over rings, the remainder of this disclosure defines curves and points operations in terms of n. These curves and operations are also applicable to embodiments that utilize curves defined over fields. In embodiments utilizing curves defined over fields, n is treated as a prime number. Algorithm 1: Double and Add Point Multiplication Algorithm Inputs: $k = {{\sum\limits_{i = 0}^{m - 1}{k_{i}{2^{i}/^{*}k_{i}}}} \in {{{\left\lbrack {0,1} \right\rbrack^{*}/P}/^{*}{Point}}\quad{on}\quad{the}\quad{{{curve}.^{*}}/{Outputs}}\text{:}}}$ Q = kP Processing: 1./^(*)Initialize  variables.^(*)/1.1Q = O 2./^(*)Compute  the  point  multiplication.^(*)/2.1  for  i = m − 1  down  to  0  do 2.1.1  Q = 2Q/^(*)Point  double^(*)/2.1.2  if  k_(i) ≠ 0  then 2.1.2.1Q = Q + P/^(*)Point  addition^(*)/3./^(*)Return  result.^(*)/3.1  Return(Q) Homogeneous Coordinates

Homogeneous coordinates represent points with three coordinates (X, Y, Z). Points represented in this form satisfy the homogeneous form of the elliptic curve equation shown in Equation (3). Y ² Z≡X ³ +aXZ ² +bZ ³ mod n  (3)

The conversion from affine to homogeneous coordinates is trivial. Assuming that P=(x, y), the representation of P in homogeneous coordinates is P=(X=x, Y=y, Z=1). The conversion of P=(X, Y, Z) from homogeneous to affine coordinates is P=(X/Z, Y/Z) provided that the divisions X/Z mod n and Y/Z mod n exist. By convention the point O in homogeneous coordinates is represented by O=(0, Y, 0).

Equation (4) shows expressions for point double, (X₃, Y₃, Z₃)=2(X₁, Y₁, Z₁), and Equation (5) shows expressions for point addition, (X₃, Y₃, Z₃)=(X₁, Y₁, Z₁)+(X₂, Y₂, Z₂). (X ₃ ,Y ₃ ,Z ₃)=2(X ₁ ,Y ₁ ,Z ₁) w≡3X ₁ ² +aZ ₁ ² mod n X ₃≡2Y ₁ Z ₁(w ²−8X ₁ Y ₁ ² Z ₁)mod n Y ₃≡4Y ₁ ² Z ₁(3wX ₁−2Y ₁ ² Z ₁)−w ³ mod n Z ₃≡8Y ₁ ³ Z ₁ ³ mod n  (4) (X ₃ ,Y ₃ ,Z ₃)=(X ₁ ,Y ₁ ,Z ₁)+(X ₂ ,Y ₂ ,Z ₂) u≡Y ₂ Z ₁ −Y ₁ Z ₂ mod n v≡X ₂ Z ₁ −X ₁ Z ₂ mod n X ₃ ≡v{Z ₂(u ² Z ₁−2v ² X ₁)−v ³ }mod n Y ₃ ≡Z ₂(3uv ² X ₁ −v ³ Y ₁ −u ³ Z ₁)+uv ³ mod n Z _(3′) ≡v ³ Z ₁ Z ₂ mod n  (5)

Equations (4) and (5) have the property that the addition of P and −P result in the conventional representation for O: (X₃, Y₃, Z₃)=(X₁, Y₁, Z₁)+(X₂, Y₂, Z₂)=(0, (−2Y₁Z₂)³Z₁Z₂, 0) when X₁/Z₁≡X₂/Z₂ mod n and Y₁/Z₁≡−Y₂/Z₂ mod n; and (X₃, Y₃, Z₃)=2(X₁, Y₁, Z₁)=(0,−(3X₁ ²+aZ₁ ²)³, 0) when Y₁/Z₁≡0 mod n (i.e., P₁ is a point of order two). When adding a point of the form O=(0, Y, 0), the expressions in Equation (4) and Equation (5) yield O=(0, 0, 0), which corresponds to O=(0, Y, 0) with Y=0.

The point double expressions yield valid results for 2P=P+(−P)=O and 2O=O. The point addition expressions yield valid result for P+(−P)=O but they yield invalid results for P+O=P when P≠O; for which, the expressions in Equation (5) compute P+O=O. The last case is handled explicitly by the point addition operation, which compares the values of the input points against O and depending on the results computes the following: R=P+Q if P≠O, Q≠O, and P≠Q using Equation (5); sets R=P if Q=O; or sets R=Q if P=O. In addition, the point addition operation performs a point double operation using Equation (4) if P=Q.

According to known complexity estimates, a point double operation requires 11 modular multiplications and a point addition requires 12 modular multiplications. These complexity estimates ignore additions because their complexities are usually much lower than the complexities of multiplications.

Jacobian Coordinates

Jacobian coordinates represent points with three coordinates (X, Y, Z). Points represented in this form satisfy the projective form of the elliptic curve equation shown in Equation (6). Y ² ≡X ³ +aXZ ⁴ +bZ ⁶ mod n  (6)

The conversion from affine to Jacobian coordinates is trivial. Assuming that P=(x, y), the representation of P in Jacobian coordinates is P=(X=x, Y=y, Z=1). The conversion of P=(X, Y, Z) from Jacobian to affine representation is P=(X/Z², Y/Z³) provided that the divisions X/Z² mod n and Y/Z³ mod n exist. By convention the point O in Jacobian coordinates is represented by O=(t², t³, 0).

For Jacobian coordinates, Equation (7) shows the expressions for point double, (X₂, Y₂, Z₂)=2(X₁, Y₁, Z₁), and Equation (8) shows the expressions for point addition, (X₂, Y₂, Z₂)=(X₀, Y₀, Z₀)+(X₁, Y₁, Z₁). (X ₂ ,Y ₂ ,Z ₂)=2(X ₁ ,Y ₁ ,Z ₁) M≡(3X ₁ ² +aZ ₁ ⁴)mod n Z ₂≡2Y ₁ Z ₁ mod n S≡4X ₁ Y ₁ ² mod n X ₂ ≡M ²−2S mod n T≡8Y ₁ ⁴ mod n Y ₂ ≡M(S−X ₂)−T mod  (7) (X ₂ ,Y ₂ ,Z ₂)=(X ₀ ,Y ₀ ,Z ₀)+(X ₁ ,Y ₁ ,Z ₁) U ₀ ≡X ₀ Z ₁ ² mod n S ₀ ≡Y ₀ Z ₁ ³ mod n U ₁ ≡X ₁ Z ₀ ² mod n S ₁ ≡Y ₁ Z ₀ ³ mod n W≡U ₀ −U ₁ mod n R≡S ₀ −S ₁ mod n T≡U ₀ +U ₁ mod n M≡S ₀ +S ₁ mod n Z ₂ ≡Z ₀ Z ₁ W mod n X ₂ ≡R ² −TW ² mod n V≡TW ²−2X ₂ mod n Y ₂≡(VR−MW ³)/2 mod n  (8)

Equations (7) and (8) have the property that the addition of P and −P result in the conventional representation for O: (X₂, Y₂, Z₂)=(X₀, Y₀, Z₀)+(X₁, Y₁, Z₁)=(t², t³, 0) where t=−2Y₁Z₀ ³ when X₀/Z₀ ²≡X₁/Z₁ ² mod n and Y₀/Z₀ ³≡−Y₁/Z₁ ³ mod n; and (X₂, Y₂, Z₂)=2(X₁, Y₁, Z₁)=(t², t³, 0) where t=−(3X₁ ²+aZ₁ ⁴) when Y₁/Z₁ ³≡0 mod n (i.e., P₁ is a point of order two).

When adding a point of the form O=(u², u³, 0), the expressions in Equation (7) yield 2O=(t², t³, 0), which matches the expected result. When adding a point of the form O=(u², u³, 0), the expressions in Equation (8) yield P+O=O=(0,0,0), which corresponds to O=(t², t³, 0) with t=0, instead of the expected result P+O=P when P≠O. The last case is handled explicitly by the point addition operation, which compares the values of the input points against O and depending on the results computes the following: R=P+Q if P≠O, Q≠O, and P≠−Q using Equation (8); sets R=P if Q=O; or sets R=Q if P=O. In addition, the point addition operation performs a point double operation using Equation (7) if P=Q.

When using Jacobian coordinates, a point double operation requires 10 modular multiplications if a/≡−3 mod n and 8 modular multiplications if a≡−3 mod n. Point addition requires 16 field multiplications when Z₁/≡1 mod n and 11 field multiplications when Z₁≡1 mod n. Some standards, such as FIPS 186-2, suggest the use of curves for which a≡−3 mod n.

Point double is the most common operation in point multiplication. As a consequence, Jacobian coordinates lead to faster point multiplications than homogeneous coordinates for curves for which a≡−3 mod n and for point multiplications that yield both the x and y coordinates of the resulting points. Some algorithms, usually specified in terms of homogenous coordinates, do not use the y coordinates of the resulting points or can recover them. Examples of these algorithms can be found in N. Demytko, “A New Elliptic Curve Based Analogue of RSA,” Advances in Cryptology—Eurocrypt '93 (LNCS 765), pp. 40-49, Springer-Verlag, 1994 (hereinafter “Demytko”), and also in E. Brier et al., “Weierstrass Elliptic Curves and Side-Channel Attacks,” Public Key Cryptography (LNCS 2274), pp. 335-345, Springer-Verlag, 2002, both of which are incorporated by reference herein.

Verification of Decryption Computations

The elliptic curve point additions and point multiplications described above are the basic mathematical operations used in elliptic curve cryptography. These operations are routinely applied, for example, in computerized cryptography systems when implementing key agreement protocols for secure communications. During implementation, erroneous computations can sometimes arise as a result of random errors, or as a result of errors maliciously induced by an attacker or active adversary. Thus, for security purposes, it is often desirable to perform independent verification of a computation in order to increase system reliability.

In a conventional system, reliable computation can be achieved with two redundant engines that independently perform the same computation or with a single engine that performs the same computation twice. If the results from the two operations match, the common result is assumed to be correct, and the communication is deemed reliable and secure. The main problem with these approaches is that they double the complexity of an already complex, time-consuming, and memory-intensive operation.

SUMMARY

Methods of reliability computation for elliptic curve cryptography (ECC) systems perform two operations according to the present invention. The complexity of the first operation is slightly higher than the complexity of an operation computed in a conventional system. The complexity of the second operation is a function of the desired degree of reliability, or the desired probability of failure detection. In general, the second operation is of much lower complexity than the first operation, thus, the first and second operations are asymmetric. The processing requirements, or total number of calculations performed by the combination of the asymmetric operations are significantly less demanding than the sum of redundant operations performed in a conventional reliability computation.

One embodiment of the method validates a point addition computation involving one or more points on a specified elliptic curve. The method comprises steps for selecting a second elliptic curve to serve as a validation curve, deriving a third elliptic curve from the specified and selected curves, and projecting points onto the derived curve. Each point projected onto the derived curve is a tuple comprising a point from the specified curve and a point from the selected curve. The method includes steps for performing a computation on the derived curve involving the projected points, validating the computation on the selected curve, extracting from the computation on the derived curve a predicted result of the computation on the selected (validation) curve, and comparing the predicted result to the validation computation performed on the selected curve. In additional steps, a predicted result of the computation to be validated may then be extracted from the computation on the derived curve. The predicted result may then be compared to an actual result of a computation on the second curve, and if the results match, the predicted result of the computation performed on the selected curve is validated.

Another embodiment of a method of the present invention validates a point multiplication computation involving one or more points on a specified elliptic curve. The method comprises steps for selecting a second elliptic curve to serve as a validation curve, deriving a third elliptic curve from the specified and selected curves, and projecting points onto the derived curve. Each point projected onto the derived curve is a tuple comprising a point to be multiplied from the specified curve and a fixed point from the selected curve that is used to establish the reliability of the point multiplication. The method includes steps for generating an addition chain for a multiplier that avoids invalid points, such as a point at infinity, or a point double in the selected curve that does not map to a point double in the specified curve. Additional method steps comprise computing a point multiplication on the derived curve, computing one or more point multiplication validations on the selected curve, extracting from the computation on the derived curve a predicted result for each computation performed on the selected (validation) curve, and comparing each predicted result to its corresponding actual result obtained from multiplication performed on the selected curve. In additional steps, a predicted result of the point multiplication computation to be validated may then be extracted from the computation on the derived curve. The predicted result may then be compared to an actual result of a computation on the second curve, and if the results match, the predicted result of the computation performed on the selected curve is validated.

Other systems, methods, features and advantages of the invention will be or will become apparent to one with skill in the art upon examination of the following figures and detailed description. It is intended that all such additional systems, methods, features and advantages be included within this description, be within the scope of the invention, and be protected by the accompanying claims.

BRIEF DESCRIPTION OF THE FIGURES

The invention can be better understood with reference to the following figures. The components in the figures are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the invention.

FIG. 1 is a block diagram embodiment of a two-party communication system, or method, employing reliability computation according to the invention.

FIG. 2 is a block diagram of one embodiment of a reliable point addition method according to the present invention.

FIG. 3 illustrates one example of a reliable point addition method according to the invention that yields a valid result for p=11, q=5, and n=55.

FIG. 4A illustrates one embodiment of a reliable point addition method according to the invention.

FIG. 4B illustrates optional process steps for the method of FIG. 4A.

FIG. 5 shows a conceptual diagram including steps for implementing a reliable point multiplication method according to the invention.

FIG. 6 is a block diagram of one embodiment of a reliable point multiplication method according to the present invention.

FIG. 7A illustrates one embodiment of a reliable point multiplication method according to the invention.

FIG. 7B illustrates optional process steps for the method of FIG. 7A.

FIGS. 8A-8B show a tabulation of relevant cases of employing a recoding adjustment algorithm in a method according to the invention.

FIG. 9 shows a tabulation of a recoding example using an adjusted addition chain in a reliable point multiplication method according to the invention, for k=30, n_(q)=5 and w=1.

FIG. 10 shows a tabulation of results of a recoding reliable point multiplication algorithm according to the invention, including the probability of estimation error for k∈[1, 2¹⁶).

FIG. 11 shows a tabulation of results of a recoding reliable point multiplication algorithm according to the invention, including the probability of estimation error for 2¹⁶ random k values in the range [1, 2¹⁹²).

DETAILED DESCRIPTION

As utilized herein, it should be appreciated that terms such as “selecting”, “deriving”, “projecting”, “providing”, “performing”, “comparing”, “extracting”, “validating” and the like, refer to the action and process of a computer system or electronic processing device that transforms data that is stored within the computer system's memory or that is otherwise accessible by the computer system.

As used herein, the term “software” includes source code, assembly language code, binary code, firmware, macro-instructions, micro-instructions, or the like, or any combination of two or more of the foregoing.

The term “memory” refers to any processor-readable medium, including but not limited to RAM, ROM, PROM, EPROM, EEPROM, disk, floppy disk, hard disk, CD-ROM, DVD, flash memory, or the like, or any combination of two or more of the foregoing, which may store data accessible by a processor such as a series of software instructions executable by a processor.

The terms “processor” refers to any device capable of executing a series of instructions and includes, without limitation, a CPU, a general- or special-purpose microprocessor, a finite state machine, a controller, computer, digital signal processor (DSP), or the like.

The term “logic” refers to implementations in hardware, software, or combinations of hardware and software.

The various embodiments disclosed herein use non-singular elliptic curves. With respect to elliptic curves defined over a field, this requires that g.c.d.(4a_(p) ³+27b_(p) ², p)=1. With respect to elliptic curves defined over a ring, this requires that g.c.d.(4a_(n) ³+27b_(n) ², n)=1, n=pq be square free (i.e., p≠q), and that p and q be odd. Although the many embodiments described herein focus on n=pq, the results can be expanded to the case where n=p₁*p₂* . . . p_(t). The notation g.c.d. refers to the greatest common divisor operation.

The mathematical operation “point addition” refers to either the addition or subtraction operation; however, for simplicity, the various exemplary embodiments show point addition operations only. Those skilled in the art will appreciate that embodiments according to the invention may also involve point subtraction.

Block Diagram

FIG. 1 illustrates a basic block diagram 100 of a two-party communication system using message encryption/decryption and employing reliability computation according to the invention. Two parties, sender 101A and receiver 100B desire to communicate information 102 confidentially over a communications channel 103. Channel 103 may represent a secured or unsecured channel. Sender 101A generates information 102 from a data source 104. Source 104 may be any source or subsystem capable of storing and/or transmitting digital information such as a computer, cellular telephone or other device or communications system having cable or wireless transmission capability. In block 105, information 102 is encrypted, for example, by an ECC technique, prior to transmission over channel 103. A data transmission error signal 111 may or may not corrupt information 102 on channel 103. Error signal 111 may occur as a random error introduced by a transmission anomaly, or an attacker or adversary 110 may maliciously introduce it.

In block 106, receiver 101B decrypts the information received, for example, by means of point multiplication operations discussed above. In order to verify the authenticity of the signal received over channel 103, block 106 performs reliable ECC computations in accordance with the present invention. Reliable ECC computations are disclosed in greater detail in the following sections. Block 106 comprises reliability computation blocks 107 and 108. In block 107, a high complexity reliability computation is performed that is of slightly higher complexity than a computation performed according to a conventional ECC decryption algorithm. In block 108, a low complexity reliability computation is performed to verify the result obtained in block 107. The computation performed in block 108 is of much lower complexity than a computation performed according to a conventional ECC decryption algorithm. Thus, the total number of calculations performed by the combination of blocks 107 and 108 is significantly lower than twice the number of calculations performed by a conventional operation.

Having decrypted the signal received and having verified its authenticity by means of reliable ECC computation, receiver 101B receives information signal 102 at its destination block 109. Destination block 109 may represent any device or subsystem capable of storing and/or receiving digital information such as a computer, cellular telephone or other device or communications system having cable or wireless receiving capability. In one or more embodiments, sender 101A and/or receiver 101B each comprise a system having a processor coupled to memory, such as a computer system. In these embodiments, data source block 104 and/or destination block 109 may be integral to the computer system, or they may be peripheral devices coupled thereto. Encryption block 105, decryption block 106, and computation blocks 107 and 108 may represent individual processors or other logic devices capable of executing one or more reliable ECC computation algorithms as a series of software instructions, or they may represent memory capable of storing the software instructions that is accessible by a processor. It should be noted that the diagram of FIG. 1 is exemplary only. Other embodiments according to the invention are possible, for example, one in which sender 101A and receiver 101B exchange information, wherein both parties include means or steps for performing the reliable ECC computation algorithms.

Reliable Point Addition (RPA)

One embodiment of the invention comprises a reliable computation method for the addition of points belonging to curves defined over prime fields F_(p). Hereinafter embodiments of this method are referred to as Reliable Point Addition (RPA).

The goal of an RPA method is to reliable compute the addition Q_(p)=P_(1p)+P_(2p), where P_(1p), P_(2p)∈E_(p). To achieve this result, an RPA method computes the following two point additions: Q_(n)=P_(1n)+P_(2n) and Q_(q)=P_(1q)+P_(2q), where P_(1n)=[P_(1p), P_(1q)], P_(2n)=[P_(2p), P_(2q)]∈E_(n) and P_(1q), P_(2q)∈E_(q). If the restrictions described above regarding elliptic curves defined over a ring are satisfied, the result Q_(p) can be derived from Q_(n)=[Q′_(p), Q′_(q)] by reducing the coordinates of Q_(n) modulo p. The derived Q′_(p) is assumed to be correct if the Q′_(q) derived from Q_(n) matches the independently computed Q_(q).

FIG. 2 shows an RPA method 200 according to the invention as it is applied to the computation of Q_(p)=P_(1p)+P_(2p). The first set of steps are steps 202A and 202B. In step 202A, points P_(1p) and P_(1q) are projected onto P_(1n) and the points P_(2p) and P_(2q) are projected onto P_(2n). These steps may comprise application of a cryptographic algorithm such as Garner's Algorithm. In step 202B, curve E_(n) is derived from E_(p) and E_(q). Note that step 202B need only be performed once for given curves E_(p) and E_(q). The second set of steps are point addition steps 204A and 204B. Step 204A computes Q_(n)=P_(1n)+P_(2n) and step 204B computes Q_(q)=P_(1q)+P_(2q). The third set of steps are steps 206A and 206B. Step 206A derives Q′_(p) from Q_(n) and step 206B derives Q′_(q) from Q_(n). The final step is step 208, which validates the result Q′_(p) by comparing Q′_(q) and Q_(q). If Q′_(q)=Q_(q), the result Q′_(p) is assumed to be correct.

Another embodiment of an RPA method according to the invention is shown below in Algorithm 2. Algorithm 2 assumes that n_(p)=#E_(p) and n_(q)=#E_(q), as it is the case for curves recommended in FIPS 186-2. FIG. 2 and Algorithm 2 make reference to Garner's algorithm, which finds the solutions x to the system of congruences x≡x_(p) mod p and x≡x_(q) mod q. Cryptographic algorithms such as Garner's algorithms are well known in the art, and can be found, e.g. in Menezes.

Given the restrictions for elliptic curves defined over a ring, choose P_(1q)=P_(2q) if P_(1p)=P_(2p) and choose P_(1q)≠P_(2q) if P_(1p)≠P_(2p).

Algorithm 2: RPA Algorithm

Inputs:

-   -   E_(p) Elliptic curve specified for point addition. Curve         parameterized by a_(p), b_(p), p, #E_(p).     -   E_(q) Elliptic curve used to validate results. Curve         parameterized by a_(q), b_(q), q, #E_(q).     -   E_(n) Elliptic curve used to compute point addition. Curve         parameterized by a_(n), b_(n), p, q, n=pq. Input provided if         curve is already defined, otherwise the algorithm computes the         parameters for this curve.     -   P_(1p), P_(2p) Points to add in E_(p), where P_(1p)≠O_(p).         P_(2p)≠O_(p), and P_(1p)+P_(2p)≠O_(p).     -   P_(1q), P_(2q) Points to add in E_(q), where P_(1q)≠O_(q),         P_(2q)≠O_(q), and P_(1q)+P_(2q)≠O_(p), and where P_(1q)=P_(2q)         if P_(1p)=P_(2p) and P_(1q)≠P_(2q) if P_(1p)≠P_(2p)

Outputs:

-   -   E_(n) Elliptic curve specified for point addition. Output only         if it has not been previously defined.     -   Q_(p) Point addition result.     -   result_is_valid True if the result is presumed to be valid and         False otherwise.

Processing:

-   -   1. /* Compute parameters for E_(n) if they are not already         defined. */     -   /* Typically done only once for a given set of curves E_(p) and         E_(q). */     -   1.1 if E_(n) is not defined then     -   1.1.1 n=pq     -   1.1.2 a_(n)=garner(a_(p), a_(q), p, q) /* a_(p)≡a_(n) mod p,         a_(q)≡a_(n) mod q */     -   1.1.3 b_(n)=garner(b_(p), b_(q), p, q) /* b_(p)≡b_(n) mod p,         b_(q)≡b_(n) mod q */     -   2. /* Compute P_(1n) and P_(2n). */     -   2.1 x_(P1n)=garner(x_(P1p), x_(P1q), p, q) /* x_(P1p)≡x_(P1n)         mod p, x_(P1q)≡x_(P1n) mod q */     -   2.2 y_(P1n)=garner(y_(P1p), y_(P1q), p, q) /* y_(P1p)≡y_(P1n)         mod p, y_(P1q)≡y_(P1n) mod q */     -   2.3 x_(P2n)=garner(x_(P2p), x_(P2q), p, q) /* x_(P2p)≡x_(P2n)         mod p, x_(P2q)=x_(P2n) mod q */     -   2.4 y_(P2n)=garner(y_(P2p), y_(P2q), p, q) /* y_(P2p)≡y_(P2n)         mod p, y_(P2q)≡y_(P2n) mod q */     -   3. /* Compute Q_(n)=P_(1n)+P_(2n)=(x_(Qn),y_(Qn)), */     -   3.1 Q_(n)=point_addition(P_(1n), P_(2n), E_(n))     -   4. /* Compute Q_(q)=P_(1q)+P_(2q)=(x_(Qq),y_(Qq)). */     -   4.1 Q_(q)=point_addition(P_(1q), P_(2q), E_(q))     -   5. /* Derive Q′_(p) and Q′_(q) from Q_(n). */     -   5.1 Q′_(p)=(x_(Q′p)≡x_(Qn) mod p, y_(Q′p)≡y_(Qn) mod p)     -   5.2 Q′_(q)=(x_(Q′q)≡x_(Qn) mod q, y_(Q′q)≡y_(Qn) mod q)     -   6. /* Compare results Q_(q) and Q′_(q) and set error status. */     -   6.1 if (x_(Qq)≡x_(Q′q) mod q) and (y_(Qq)≡y_(Q′q) mod q) then         result_is_valid=True     -   6.2 else result_is_valid=False     -   7. /* Return result. */     -   7.1 return (Q′_(p), E_(n), result_is_valid)

The points of interest in E_(n) are the points P_(n)=[P_(p), P_(q)], where P_(p)∈E_(p), P_(q)∈E_(q), P_(p)≠O_(p), and P_(q)≠O_(q), together with the point at infinity O_(n)=[O_(p), O_(q)]. All other points are considered invalid points. Given that there are #E_(p) points in E_(p), including the point at infinity, and #E_(q) points in E_(q), including the point at infinity, the total number of points of interest in E_(n) is (#E_(p)−1)*(#E_(q)−1)+1 (˜#E_(p)#E_(q)). Assuming that the Q′_(q) matches Q_(q), the probability that result is assumed to be right when in fact it is wrong is approximately 1/#E_(q). Note that in the set of points of interest there are #E_(p)−1 points P_(p) that correspond to a given point P_(q).

The curve E_(q) influences the probability of detecting failures. This curve need not be a cryptographically secure curve; it need only contain enough points to satisfy the desired detection probability. From an implementation perspective, it would also be beneficial to choose curve parameters that minimize the computational complexity of the operations in E_(n) and E_(q). For example, q can be chosen so that it minimizes the complexity of the modular operations required to compute point additions.

The point addition Q_(n)=P_(1n)+P_(2n) is expected to be slightly more complex than the point addition Q_(p)=P_(1p)+P_(2p). The complexity of the point addition Q_(q)=P_(1q)+P_(2q) is expected to be much lower than the complexity of the point addition Q_(p)=P_(1p)+P_(2p). In addition to these point operations, the RPA requires at least four computations involving Garner's algorithm (step 2) and four reductions (step 5).

RPA Example

FIG. 3 illustrates an RPA example 300. Steps 302A, 302B, 304A, 304B, 306A, 306B and 308 correspond to like-numbered steps of method 200. In RPA example 300, a valid result is achieved for p=11, q=5, and n=55. However, an RPA computation may not guarantee a valid result. Furthermore, an invalid result or failure may be detectable or undetectable.

An example of a detectable failure is the following: If there is a failure in the Point Addition 1 that results, for example, in Q_(n)=(38,32), which is a point in E_(n), then Q′_(q) would be (3,2) and the check will determine that the derived Q′_(p)=(5,10) is an invalid result.

An example of an undetectable failure is the following: If there is a failure in the Point Addition 1 that results, for example, in Q_(n)=(48,3), which is a point in E_(n), Q′_(q) would be (3,3) and the check will assume that the derived Q′_(p)=(4,3) is a valid result when in reality it is not. There are about #E_(p) points that would satisfy the check out of about #E_(p)#E_(q) points of interest in E_(n); therefore, the probability of detecting a random failure that results in a point of interest is approximately 1/# E_(q).

FIG. 4 illustrates another embodiment of a method 400 according to the invention for validating a computation involving one or more points on a specified elliptic curve E_(p). Method 400 begins with step 402, which comprises selecting a second elliptic curve E_(q). Preferably, curve E_(q) is selected to achieve a desired balance between validation accuracy and the computational complexity of the operations in E_(n) and E_(q). The next step 404 comprises deriving a third elliptic curve, E_(n), from curves E_(p) and E_(q). As previously discussed in method 200, curve E_(n) may be derived by means of an appropriate cryptographic algorithm such as Garner's Algorithm.

The same or a similar algorithm may be employed in the next step 406, which comprises projecting one or more points Pj_(n) onto E_(n). Each point Pj_(n) is a projection of a set of points [Pj_(p), Pj_(q)] where Pj_(p)∈E_(p), Pj_(q)∈E_(q), and j=1 to t (t an integer). The next two steps are similar. Step 408 comprises performing a computation on E_(n) involving the one or more projected points Pj_(n). In one implementation, this computation comprises a point addition computation that yields a result Q_(n)=P_(1n)+P_(2n). Step 410 comprises performing a computation on E_(q) involving one or more points Pj_(q). In one implementation, the computation in step 410 computes Q_(q)=P_(1q)+P_(2q). The next step is step 412. Step 412 comprises extracting from the computation on E_(n) a predicted result of the computation on E_(q). This step is illustrated above, for example, as step 206B of method 200. In the final step 414 of method 400, the predicted result from the previous step is compared to an actual result of the computation on E_(q).

The following additional steps may be performed in a method 400 according to the invention. After step 414, step 416 may comprise extracting, from the computation on E_(n), a predicted result of the computation to be validated. In one implementation, the computation to be validated is the point addition Q_(p)=P_(1p)+P_(2p). In step 418, a determination is made whether the predicted result of the computation on E_(q) equals the actual result of the computation on E_(q), and if so, validating the result predicted in step 416.

Reliable Point Multiplication (RPM)

Another embodiment of the invention comprises a reliable computation method for point multiplications for curves defined over prime fields F_(p). Hereinafter embodiments of this method are referred to as Reliable Point Multiplication (RPM).

FIG. 5 shows one embodiment of an RPM method as it is applied to the computation of kP_(p) on an elliptic curve E_(p). This curve is modeled in the figure as an ellipse labeled E_(p). A second elliptic curve is selected, and is modeled in the figure as an ellipse labeled E_(q). A third elliptic curve is derived from E_(p) and E_(q), and is modeled as the larger ellipse labeled E_(n).

The steps in FIG. 5 are illustrated conceptually by dashed lines and solid lines. The first step is to project points P_(p) and P_(q) onto P_(n). This step is illustrated by the dashed lines labeled “1p” and “1q” that project to point P_(n)=[1P_(p), 1P_(q)] on curve E_(n). The figure shows points in E_(n) including P_(n), as tuples of the form P_(n)=[P_(p), P_(q)] that indicates their projections onto E_(p) and E_(q). P_(p) is the point on E_(p) of order n_(p) that is to be multiplied, and P_(q) is a fixed point on E_(q) of order n_(q) that is used to establish the reliability of the point multiplication. The figure uses diamonds to represent points P_(n)=[P_(p), P_(q)] for which P_(p) or P_(q) are the points at infinity in E_(p) or E_(q). This embodiment of RPM requires that n_(p) and n_(q) be coprime (i.e. no factors in common) and that they be odd.

The second step is illustrated by the sequence of solid lines labeled “2 n” and by the sequence of solid lines labeled “2 q”. The “2 n” portion of this step computes kP_(n) on E_(n) using an addition chain that avoids points iP_(n) where i is a multiple of n_(q) or n_(p). This addition chain must also preclude point additions that project to point doubles in either E_(p) or E_(q) (but not in both) for applications that require the use of distinct operations for point doubles and point additions. This is one of the restrictions discussed in the context of elliptic curves defined over a ring. The “2 q” portion of this step also computes (k mod n_(q))P_(q) on E_(q), as illustrated.

The third step is illustrated by the dashed lines labeled “3 p” and “3 q”. The “3 p” portion of this step projects the resulting point kP_(n) onto kP_(p) on E_(p). The “3 q” portion of this step projects the resulting point kP_(n) onto kP_(q) on E_(q). In the final step (not illustrated), the projected result kP_(q) is compared against the independently computed (k mod n_(q))P_(q), and, if the results match, the projected point kP_(p) is assumed to be the desired result.

The space of valid results Q_(n)=[Q′_(p),Q′_(q)] for multiplications kP_(n) consists of approximately n_(p) n_(q) points. For a given point Q′_(q) there are n_(p) valid points Q′_(p). An RPM method according to the invention detects invalid results for which Q_(q)≠Q′_(q), but it fails to detect invalid results for which Q_(q)=Q′_(q). Given that there are about n_(p) points that satisfy the last condition and that there are about n_(p) n_(q) points of interest in E_(n), the probability of failing to detect invalid results that map to points of interest in E_(n) is approximately 1/n_(q) when considering failures with equal likelihood.

FIG. 6 shows an RPM method 600 according to the invention as it is applied to the computation of kP_(p) on E_(p). The first set of steps are steps 602A and 602B. In step 602A, points P_(p) and P_(q) are projected on P_(n) using an appropriate cryptographic algorithm such as Garner's Algorithm. In step 602B, curve E_(n) is derived from E_(p) and E_(q). The second set of steps are point multiplication steps 604A and 604B. Step 604A computes Q_(n)=k_(r)P_(n) and step 204B computes Q_(q)=k_(rq)P_(q). The third set of steps are steps 606A and 606B. Step 606A derives Q′_(p) from Q_(n) and step 606B derives Q′_(q) from Q_(n). Next, in step 608, the results for Q_(q) and Q′_(q) are compared. If Q′_(q)=Q_(q), the result Q′_(p) is assumed to be valid. In the next step 610, if necessary to avoid an undesirable point, the result Q′_(p) is adjusted using the recode parameter adj to obtain Q_(p). This is achieved by the point addition on E_(p): Q_(p)=Q′_(p)+adj*P_(p). Next, in step 612, a check is performed to determine whether the resulting point Q_(p) exists on curve E_(p). In the final step 614, appropriate logic, such as an AND gate, is used to determine whether there has been a valid result. If the result in step 608 and the result for step 612 are both true, then a logical one is output. If the result of either step 608 or step 612 is false, then a logical zero is output.

The block diagram of method 600 covers the case shown in FIG. 5 along with the cases for which a final result is adjusted. A final result may need to be adjusted to avoid an undesirable point double in E_(q) that does not map to a point double in E_(p). The final result also needs to be adjusted when k≡0 mod n_(q), a condition that cannot be avoided with the addition chain mentioned previously. When using unsigned addition chains, multiples of n_(p) can be avoided by reducing k modulo n_(p) at the beginning of the point multiplication.

When k≡0 mod n_(q), kP_(q)=O_(q). To support this case, the RPM method can compute the following point multiplications: Q_(n)=[Q′_(p), Q′_(q)]=k_(r)P_(n) and Q_(q)=k_(rq)P_(q), where k_(r)=k−adj, k_(r)/≡0 mod n_(q), and k_(rq)=k_(r) mod n_(q). If Q_(q)=Q′_(q), the result Q′_(p) is assumed to be valid. The final result is computed as follows: Q_(p)=Q′_(p)+adj*P_(p). To verify that errors are not introduced in this final step, a check is done to verify that Q_(p) is in E_(p).

The addition chain may represent k as the sum k_(r)+adj, when it needs to avoid point additions that result in a point double in either E_(p) or E_(n) (but not on both). The following discussion assumes that n_(p) is prime and very large as it is the case for the curves specified in FIPS 186-2. When using unsigned addition chains with these curves, the condition to avoid is a point addition that projects to a point double in E_(q) and to a point addition in E_(p).

Algorithm 3 discloses additional details concerning RPM computation performed in accordance with the block diagram of FIG. 6.

Algorithm 3: RPM Algorithm

Inputs:

-   -   E_(p) Elliptic curve specified for point multiplication. Curve         parameterized by a_(p), b_(p), p, #E_(p).     -   E_(q) Elliptic curve used to validate results. Curve         parameterized by a_(q), b_(q), q, #E_(q).     -   E_(n) Elliptic curve used to compute point multiplication. Curve         parameterized by a_(n), b_(n), p, q, n=pq. Input provided if         curve is already defined, otherwise the algorithm computes the         parameters for this curve.     -   P_(p) Base point for point multiplication. Order of point is         n_(p). FIPS 186-2 recommends points with prime order n_(p).     -   P_(q) Base point for redundant computation. Order of point is         n_(q), where g.c.d.(n_(p), n_(q))=1.     -   k Point multiplier.

Outputs:

-   -   E_(n) Elliptic curve specified for point multiplication. Output         only if it has not been previously defined.     -   Q_(p) Point multiplication result.     -   result_is_valid True if the result is presumed to be valid and         False otherwise.

Processing:

-   -   1. /* Compute parameters for E_(n) if they are not already         defined. */     -   /* Typically done only once for a given set of curves E_(p) and         E_(q). */     -   1.1 if E_(n) is not defined then     -   1.1.1 n=pq     -   1.1.2 a_(n)=garner(a_(p), a_(q), p, q) /* a_(p)≡a_(n) mod p,         a_(q)≡a_(n) mod q */     -   1.1.3 b_(n)=garner(b_(p), b_(q), p, q) /* b_(p)≡b_(n) mod p,         b_(q)≡b_(n) mod q */     -   2. /* Compute P_(n) from P_(p) and P_(q. */)     -   2.1 x_(Pn)=garner(x_(Pp), x_(Pq), p, q) /* x_(Pp)≡x_(Pn) mod p,         x_(Pq)≡x_(Pn) mod q */     -   2.2 y_(Pn)=garner(y_(Pp), y_(Pq), p, q) /* y_(Pp)≡y_(Pn) mod p,         y_(Pq)≡y_(Pn) mod q */     -   3. /* Recode k as k=k_(r)+adj and compute k_(rq)=k_(r) mod         n_(q). */     -   /* Recoding avoids partial results iP where i=n_(q) or n_(p) and         it can also avoid additions that would project to point doubles         in E_(q) or E_(q) but not in both for applications requiring         different operations for point addition and point double. */     -   /* Note that k_(r)P_(q)=(k_(r) mod n_(q))P_(q)=k_(rq)P_(q). */     -   3.1 k_(r), adj, k_(rq)=recode(k, n_(p), n_(q))     -   4. /* Compute Q_(n)=k_(r)P_(n)=(k−adj)P_(n)=(x_(Qn),y_(Qn)). */     -   4.1 Q_(n)=point_multiplication(k_(r), P_(n), E_(n))     -   5. /* Compute Q_(q)=k_(r)P_(q)=(k_(r) mod         n_(q))P_(q)=(x_(Qq),y_(Qq)). */     -   5.1 Q_(q)=point_multiplication(k_(rq), P_(q), E_(q))     -   6. /* Derive Q′_(p) and Q′_(q) from Q_(n). */     -   6.1 Q′_(p)=(x_(Q′p)≡x_(Qn) mod p, y_(Q′p)≡y_(Qn) mod p)     -   6.2 Q′_(q)=(x_(Q′q)≡x_(Qn) mod q, y_(Q′q)≡y_(Qn) mod q)     -   7. /* Compare results Q_(q) and Q′_(q) and set error status. */     -   7.1 if (x_(Qq)≡x_(Q′q) mod q) and (y_(Qq)≡y_(Q′q) mod q) then         result_is_valid=True     -   7.2 else result_is_valid=False     -   8. /* Adjust Q′_(p). */     -   8.1 Q_(p)=point_addition(Q′_(p), adj, P_(p), E_(p)) /*         Q_(p)=Q′_(p)+adj*P_(p)=kP_(p)*/     -   9 /* Check that resulting point is on the curve and set error         status. */     -   9.1 if y_(Qp) ²mod p/≡x_(Qp) ³+a_(p)x_(Qp)+b_(p) mod p then         result_is_valid=False */     -   10. /* Return result. */     -   10.1 return (Q_(p), E_(n), result_is_valid)

FIG. 7 illustrates another embodiment of a method 700 according to the invention for validating a point multiplication kP_(p) on a specified elliptic curve E_(p) defined over a prime field, where k is an integer and P_(p) is a point in E_(p). Method 700 begins with step 702, which comprises selecting one or more elliptic validation curves E_(qi), where i=1 to m (m an integer). The next step 704 comprises deriving an elliptic curve E_(n) from the specified curve E_(p) and the one or more validation curves E_(qi). This derivation may be performed, for example, according to a cryptographic algorithm such as Garner's Algorithm. In the next step 706, one or more points Pj_(n) are projected onto E_(n), each point Pj_(n) a projection of a set of points [Pj_(p), Pj_(qi)]=[Pj_(p), Pj_(q1), Pj_(q2), . . . Pj_(qm)], where Pj_(P)∈E_(p), Pj_(qi)∈E_(qi), and j=1 to m (m an integer).

The next step 708 comprises generating an addition chain for k that avoids invalid points. Examples of invalid points include a point double in E_(q) that does not map to a point double in E_(p). In step 710, a point multiplication Q_(n)=kPj_(n) is computed for Pj_(n) on curve E_(n). In step 712, point multiplications Q_(qi)=(k mod n_(qi))Pj_(qi) are computed for each Pj_(qi) of order n_(qi) on each curve E_(qi), respectively. Then, step 714 is performed to extract, from the computation on E_(n), a predicted result for each computation on a curve E_(qi). Finally in step 716 each predicted result is compared to its corresponding actual result obtained from the computation on E_(qi).

The following additional steps may be performed in a method 700 according to the invention. After step 716, step 718 may comprise extracting, from the computation on E_(n), a predicted result of the computation to be validated. In one implementation, the computation to be validated is a point multiplication of the form Q_(p)=kP_(p). In step 720, a determination is made whether the predicted result for each computation on E_(qi) equals the corresponding actual result, and if so, validating the result predicted in step 718.

k Recoding

The RPM method relies on the recoding of k in a manner that the partial sums of segments of the addition chain do not result in numbers that are multiples of n_(p) or n_(q). If, for example, an addition chain yields an intermediate value k_(inv)=c*n_(q), the partial result of the point multiplication corresponds to k_(inv)P_(n)=k_(inv)[P_(p),P_(q)]=[k_(inv)P_(p), O_(q)], which is an invalid point. This embodiment of RPM also requires that additions on E_(n) when projected to the curves E_(p) and E_(n) also correspond to additions or doubles but not a mix of the two.

To minimize the probability of performing an invalid operation, n_(p) and n_(q) can be chosen to be very large. However, for computational speed, a curve E_(q) should be chosen as small as possible within limits that meet expected reliability criteria. Thus, a tradeoff exists between speed and reliability. As processing complexity is simplified, the probability of performing invalid operations rises, thus forcing the use of mechanisms that avoid these operations or compensate for them. For reliable computation, one design alternative is to choose a curve E_(q) large enough so that the probability of performing an invalid operation is small. This system would use a simpler operation in step 3 and would also avoid step 8 of Algorithm 3. The drawback of such systems is that it could lead to high computational complexity.

Another design alternative is to choose a curve E_(q) small enough to meet the desired error probability and to use an addition chain that avoids invalid operations. The following section describes an unsigned left-to-right windowing algorithm that meets these criteria. Those skilled in the art will appreciate that this and other recoding concepts disclosed herein can be applied to other point multiplication algorithms, such as fixed and non-fixed-point multiplication algorithms, simultaneous point multiplication algorithms, etc.

Unsigned Windowing Point Multiplication Algorithm with Adjustment

In another embodiment of a reliable ECC computation method according to the invention, a two-step recoding algorithm is employed to avoid invalid point additions. One implementation of a two-step recoding algorithm is shown below in the combination of Algorithm 4 and Algorithm 5. The first step in the two-step recoding algorithm is Algorithm 4, which comprises a classical unsigned, left-to-right, fixed-window recoding algorithm. The second step in the two-step recoding algorithm is Algorithm 5. Algorithm 5 is an adjustment algorithm that adjusts the results of Algorithm 4 that would lead to invalid point additions.

The inputs to Algorithm 4 are a number k and the window size w, and the output is a radix 2^(w) number expressed by a non-redundant digit set with digit values in the range [0, 2^(w)). The recoded representation includes on average (2^(w)−1)t/2^(w) nonzero digits, where t represents the total number of digits required to represent k.

The inputs to Algorithm 5 are the recoded output of Algorithm 4, the window size w, and a number n_(q), which value is to be excluded from the prime factorization of partial sums of the addition chain. The result of this algorithm is a number represented, uniquely, using three parameters k′, k″, and adj, which sum is equal to k. Algorithm 4: Classical Unsigned, Left-To-Right, Fixed-Window Recoding Algorithm (unsigned_left_right_recode) Inputs: ${k = {{\sum\limits_{i = 0}^{m - 1}{k_{i}{2^{i}/^{*}k}}} < n_{p}}},{k_{i} \in {{{\left\lbrack {0,1} \right\rbrack^{*}/w}/^{*}{Window}}\quad{{{size}.^{*}}/{Outputs}}\text{:}}}$ ${{kr} = {{\sum\limits_{i = 0}^{t - 1}{{kr}_{i}{2^{wi}/^{*}{kr}_{i}}}} \in \left\lbrack {0,2^{w}} \right)}},{t = {{\left\lceil {m/w} \right\rceil^{*}/{Processing}}\text{:}}}$ 1./^(*)Determine  the  number  of  digits  required  to  represent  k.^(*)/1.1t = ⌈m/w⌉ ${{2./^{*}{Recode}}\quad{{k.^{*}}/2.1}{kr}_{t - 1}} = {{\sum\limits_{j = 0}^{{({m - 1})} - {{({t - 1})}w}}{{kr}_{{{({t - 1})}^{*}w} + j}{2^{j}/^{*}{Most}}\quad{significant}\quad{{{digit}.^{*}}/2.2}\quad{for}\quad i}} = {{t - {2\quad{down}\quad{to}\quad 0\quad{{do}/^{*}{Least}}\quad{significant}\quad{{{digits}.^{*}}/{kr}_{i}}}} = {\sum\limits_{j = 0}^{w - 1}{{kr}_{{i^{*}w} + j}2^{j}}}}}$ 3.return  (kr)

Algorithm 5: Recoding Adjustment Algorithm for Unsigned Fixed-Window Recoding (unsigned_left_right_recode_adj) Inputs: ${k = {{\sum\limits_{i = 0}^{t - 1}{k_{i}{2^{wi}/^{*}k_{i}}}} \in \left\lbrack {0,2^{w}} \right)}},{k \in \left\lbrack {1,n_{p}} \right)},{{{n_{p}{{rep}.\quad{order}}\quad{of}\quad{{{P_{p}}^{*}/w}/^{*}{Window}}\quad{{{{size}.^{*}}/n_{q}}/^{*}{Multiple}}\quad{to}\quad{{avoid}.\quad n_{q}}} > {2^{w + 1} - {1\quad{is}\quad{{{prime}.^{*}}/{Outputs}}{\text{:}/^{*}k}}}} = {{k^{\prime} + k^{\prime\prime} + {{{adj}^{*}/}/^{*}{g.c.d.\left( {{\sum\limits_{i = j}^{t - 1}{\left( {k_{i}^{\prime} + k_{i}^{\prime\prime}} \right)2^{w{({i - j})}}}},n_{q}} \right)}}} = {{1\quad{for}\quad j} = {{t - {1\quad\ldots\quad{0^{*}/k^{\prime}}}} = {{{\sum\limits_{i = 0}^{t - 1}{k_{i}^{\prime}{2^{wi}/^{*}k_{i}^{\prime}}}} \in {\left\lbrack {0,2^{w}} \right\rbrack^{*}/k^{\prime\prime}}} = {{\sum\limits_{i = 0}^{t - 1}{k_{i}^{\prime\prime}{2^{wi}/^{*}k_{i}^{\prime\prime}}}} \in {{\left\lbrack {0,2^{w}} \right\rbrack^{*}/{adj}}/^{*}{adj}} \in {{\left\lbrack {0,1} \right\rbrack^{*}/{Processing}}\text{:}}}}}}}}$ 1./^(*)Initialize  variables^(*)/1.1adj = 0 1.2k_(rq) = 0 2./^(*)Recode^(*)/2.1  for  i = t − 1  down  to  0/^(*)Absorb  adjustment.^(*)/2.1.1  if  adj ≠ 0  then 2.1.1.1k_(i)^(′) = 2^(w) 2.1.1.2k_(i)^(′′) = k_(i) 2.1.2  else/^(*)adj = 0^(*)/2.1.2.1k_(i)^(′) = k_(i) 2.1.2.2k_(i)^(′′) = 0 2.1.3adj = 0/^(*)Update  k_(rq).^(*)/2.1.4k_(rq) = k_(rq)2^(w)mod  n_(q)/^(*)Adjust  if  sum  leads  to  multiple  of  n_(q)  or  double  in  E_(q).^(*)/2.1.5  if  (k_(rq) + k_(i)^(′) ≡ 0  mod  n_(q))  or  (k_(rq) − k_(i)^(′) ≡ 0  mod  n_(q))  then 2.1.5.1k_(i)^(′) = k_(i)^(′) − 1 2.1.5.2k_(i)^(′′) = k_(i)^(′′) + 1/^(*)Update  k_(rq).^(*)/2.1.6k_(rq) = k_(rq) + k_(i)^(′)  mod  n_(q)/^(*)Adjust  if  sum  leads  to  multiple  of  n_(q)  or  double  in  E_(q).^(*)/2.1.7  if  (k_(rq) + k_(i)^(′′) ≡ 0  mod  n_(q))  or  (k_(rq) − k_(i)^(′′) ≡ 0  mod  n_(q))  then 2.1.7.1k_(i)^(′′) = k_(i)^(′′) − 1 2.1.7.2adj = 1/^(*)Update  k_(rq).^(*)/2.1.8k_(rq) = k_(rq) + k_(i)^(′′)  mod  n_(q) 3./^(*)Return  result^(*)/3.1  return  (k^(′), k^(′′), adj) Description of Adjustment Algorithm

The table in FIGS. 8A-8B shows the cases of interest in the loop of Algorithm 5. The steps in the top row of the table correspond to the steps in Algorithm 5.

When Algorithm 4 generates an addition chain that does not lead to invalid point additions, Algorithm 5 outputs k′=k, k″=0, and adj=0. For this scenario, all the loop iterations correspond to case 0 in the table.

Case 1 corresponds to finding a partial sum that is a multiple of n_(q). Cases 2 and 3 correspond to finding addition chains that would lead to undesirable point doubles in E_(q). Case 2 propagates the condition while case 3 is able to resolve it without propagating adjustments.

Cases 4 and 5 correspond to adjustment propagations from the previous iterations of the loop that result in partial addition chains whose sums are multiples of n_(q). Case 4 is unable to resolve adjustment propagation because k_(i) is zero. Case 5 resolves adjustment propagation.

Cases 6 to 10 correspond to adjustment propagations from the previous iterations that would lead to undesirable point doubles in E_(q). Cases 6 and 8 resolve previous adjustments. Cases 7 and 9 resolve previous adjustments but they encountered multiples of n_(q), which resolution they propagate. Case 10 resolves a previous adjustment but encounters another condition that would lead to an undesirable point double in E_(q).

The cases listed in the table assume that n_(q)>2^(w+1)−1. This n_(q) selection avoids encountering an undesirable condition after an adjustment; for example, when subtracting one from k′_(i) in case 1, the resulting k′_(i)−1 is not equal to k_(rq), which would lead to an undesirable double operation in E_(q). Cases 7, 9, and 10 can be avoided with proper n_(q) selection.

Example of Recoding Algorithm

The table in FIG. 9 shows a recoding example according to the invention. This example shows recoding of an addition chain adjusted according to Algorithm 5 with k=30, n_(q)=5, and w=1. When used in a point multiplication process, the addition chain avoids invalid point doubles and points that will project the points at infinity in E_(q). This example shows the recoding of k=(k₄k₃k₂k₁k₀)₂ as the sum of k=k′+k″+adj, where k′=(k′₄k′₃k′₂k′₁k′₀)₂, k″=(k″₄k″₃k″₂k″₁k″₀)₂, and adj is a scalar (adj refers to the value of adj at the end of the algorithm).

Point Multiplication Algorithm with Adjustment

In another aspect of the invention, RPM may be computed after a recoding adjustment. Algorithm 6 shows the recoding algorithm correspondent to step 3.1 of Algorithm 3. Algorithm 7 shows the point multiplication function correspondent to step 4.1 of Algorithm 3. The point multiplication in step 5.1 of Algorithm 3 need not be computed using Algorithm 7. This point multiplication can be computed using classical point multiplication algorithms, including fixed-point algorithms. Algorithm 6: Fixed-Window Recoding Algorithm with Adjustment Inputs: $k = {{{\sum\limits_{i = 0}^{m - 1}{k_{i}{2^{i}/^{*}k_{i}}}} \in {{{\left\lbrack {0,1} \right\rbrack^{*}/w}/^{*}{Window}}\quad{{{{size}.^{*}}/n_{q}}/^{*}{Multiple}}\quad{to}\quad{{avoid}.\quad n_{q}}\quad{is}\quad{{{prime}^{*}/n_{p}}/^{*}{Multiple}}\quad{to}\quad{{avoid}.\quad n_{p}}\quad{is}\quad{{prime}^{*}/{Outputs}}{\text{:}/^{*}k}}} = {{k^{\prime} + k^{\prime\prime} + {{{adj}^{*}/}/^{*}{g.c.d.\left( {{\sum\limits_{i = j}^{t - 1}{\left( {k_{i}^{\prime} + k_{i}^{\prime\prime}} \right)2^{w{({i - j})}}}},n_{q}} \right)}}} = {{1\quad{for}\quad j} = {{t - {1\quad\ldots\quad{0^{*}/k^{\prime}}}} = {{{\sum\limits_{i = 0}^{t - 1}{k_{i}^{\prime}{2^{wi}/^{*}k_{i}^{\prime}}}} \in {\left\lbrack {0,2^{w}} \right\rbrack^{*}/k^{\prime\prime}}} = {{\sum\limits_{i = 0}^{t - 1}{k_{i}^{\prime\prime}{2^{wi}/^{*}k_{i}^{\prime\prime}}}} \in {{\left\lbrack {0,2^{w}} \right\rbrack^{*}/{adj}}/^{*}{adj}} \in {{\left\lbrack {0,1} \right\rbrack^{*}/{Processing}}\text{:}}}}}}}}$ 1./^(*)Limit  values  of  k  to  range  [0, n_(p))(typically  k < n_(p)).^(*)/1.1k = k  mod  n_(p) 2./^(*)Perform  classical  recoding  of  k(Algorithm  4).^(*)/2.1kr = unsigned_left_right_recode(k, w) 3./^(*)Adjust  recoding  (Algorithm  5).^(*)/3.1k^(′), k^(′′), adj = unsigned_left_right_recode_adj(kr, w, n_(q)) 4./^(*)Return  result.^(*)/4.1  return(k^(′), k^(′′), adj)

Algorithm 7: Fixed-Window Point Multiplication Algorithm with Adjustment ${{{Inputs}{\text{:}/^{*}k^{\prime}}} + k^{\prime\prime}} = {{k - {adj}} =^{*}{{/k^{\prime}} = {{{\sum\limits_{i = 0}^{t - 1}{k_{i}^{\prime}{2^{wi}/^{*}k_{i}^{\prime}}}} \in {\left\lbrack {0,2^{w}} \right\rbrack^{*}/k^{\prime\prime}}} = {{\sum\limits_{i = 0}^{t - 1}{k_{i}^{\prime\prime}{2^{wi}/^{*}k_{i}^{\prime\prime}}}} \in {\left\lbrack {0,2^{w}} \right\rbrack^{*}/P} \in {{E_{n}/^{*}{Point}}\quad{on}\quad{elliptic}\quad{curve}\quad{defined}\quad{over}\quad{{{ring}.^{*}}/{Outputs}}\text{:}}}}}}$ Q = −(k^(′) + k^(′′))P/^(*)Point  multiplication  result.^(*)/Processing: 1./^(*)Initialize  values.^(*)/1.1Q = O 1.2P₁ = P 2./^(*)Pre-compute  points.^(*)/2.1.  for  i = 2  to  2^(w)  do 2.1.1.P_(i) = P_(i − 1) + P₁ 3./^(*)Compute  the  point  multiplication^(*)/3.1  for  i = t − 1  down  to  0  do 3.1.1Q = 2^(w)Q/^(*)Computed  by  doubling  Qw  times:  (2(2(2(  …  2(Q)  …  ))))^(*)/3.1.2  if  k_(i)^(′) ≠ 0  then 3.1.2.1Q = Q + P_(k_(i)^(′)) 3.1.3  if  k_(i)^(′′) ≠ 0  then 3.1.3.1Q = Q + P_(k_(i)^(′′))4./^(*)Return  result^(*)/4.1  return  (Q) Performance of Rpm Algorithm when Using Fixed-Window Recoding

The following sections develop expressions for estimating the need for Algorithm 5 adjustments and also provide general complexity approximations for the RPM algorithm. The general complexity estimates assumes a low need of adjustment, which result from the use of relatively large values of n_(q) (e.g., 16 bit prime).

Probability of Encountering an Addition Chain that does not Require Adjustments

Algorithm 5 adjusts the results of Algorithm 4 so that invalid operations in E_(n) are avoided. The conditions to avoid correspond to multiples of n_(q) that lead to O_(q) when results in E_(n) are projected into E_(q) and to additions of two values that modulo n_(q) correspond to the same value, a condition that projects to a point double in E_(q) and a point addition in E_(p).

In another aspect of the invention, to establish the need for addition chain adjustment, additional method steps may be required that estimate the probability of obtaining an addition chain from Algorithm 4 that avoids undesirable conditions.

These methods include an expression for estimating the probability of avoiding multiples of n_(q), and also expressions for estimating the probability of avoiding undesirable point doubles when the operations are projected into E_(q). An additional method includes an expression that covers both cases. For simplicity, the probabilities are described using as an example the classical double and add algorithm (w=1). Generalized expressions for the fixed-window algorithm are also provided. FIGS. 10 and 11 show tabulated results of complexity estimates' error probabilities gathered from running simulations for random values of k.

Consider the case of the double and add point multiplication algorithm, which scans the bits of the multiplier k=(k_(m) _(k) ⁻¹, . . . ,k₁,k₀)₂ from its most significant bit (MSB) to its least significant bit (LSB). Let m_(k)=┌log₂ k┐, m_(nq)=└log₂ n_(q)┘, k_(m) _(k−1) >0, and let n_(q) be an odd prime greater that three.

The scanning of the first m_(nq) bits (k_(m) _(k) ⁻¹, . . . , k_(m) _(k) _(−m) _(nq) )₂ does not yield a multiple of n_(q) because (k_(m) _(k) ⁻¹, . . . , k_(m) _(k) _(−m) _(nq) )₂<2^(m) ^(nq) <n_(q). If bit k_(m) _(k) _(−m) _(nq) ⁻¹ is zero, the partial result (k_(m) _(k) ⁻¹, . . . , k_(m) _(k) _(−m) _(nq) )₂ is multiplied by two, which is not a factor of n_(q), and therefore, the result (k_(m) _(k) ⁻¹, . . . , k_(m) _(k) _(−m) _(nq), k_(m) _(k) _(−m) _(nq) ⁻¹=0)₂ is not a multiple of n_(q). On the other hand, if k_(m) _(k) _(−m) _(nq) ⁻¹ is one, about 1/n_(q) of the possible values (k_(m) _(k) ⁻¹, . . . , k_(m) _(k) _(−m) _(nq) , k_(m) _(k) _(−m) _(nq) ⁻¹=1)₂ are multiples of n_(q).

For the last approximation let k_(tmp)=(k_(m) _(k) ⁻¹, . . . , k_(m) _(k) _(−m) _(nq) )₂∈[1,n_(q)). The double operation 2k_(tmp) mod n_(q)∈[1,n_(q)) permutes the values of k_(tmp). The addition that follows permutes the values again, and pushes the values k_(tmp)≡(n_(q)−1)/2 mod n_(q) to be congruent to n_(q) (k_(tmp)=2k_(tmp)+k_(m) _(k) _(−m) _(nq) ⁻¹≡0 mod n_(q)). Assuming that all the values are equally distributed, approximately 1/n_(q) of the values become a nonzero multiple of n_(q).

Given that $k_{tmp} = {\sum\limits_{i = {m_{k} - m_{nq}}}^{m_{k} - 1}{k_{i}2^{i - {({m_{k} - m_{nq}})}}}}$ is not a multiple of n_(q), multiples of n_(q) are encountered only when the bits k_(i) for i∈[0,m_(k)−m_(nq)) are not zero. When a nonzero bit k_(i) is encountered, the probability that the partial result is a multiple of n_(q) is approximately 1/n_(q). The probability that k_(i) is nonzero is ½ for a random k. Therefore, using the expression shown in Equation (9), the probability that a multiple of n_(q) is not encountered in the partial sums of an addition chain can be approximated. In this equation, Pr(k_(i)≠0) represents the probability that a bit of k is one.

The probabilities of encountering invalid double operations can also be approximated using the same approach used above for multiples of n_(q). As in the case of multiples of n_(q), possible invalid doubles could start occurring when processing k_(m) _(k) _(−m) _(nq) ⁻¹, and possible doubles could result only when processing nonzero bits k_(i) for i∈[0,m_(k)−m_(nq)). The partial value of (k_(m) _(k) ⁻¹, . . . , k_(m) _(k) _(−m) _(nq) )₂ is lower than n_(q) but it is larger than any value that k_(m) _(k) _(−m) _(nq) ⁻¹ can take; therefore, the addition chain cannot lead to invalid doubles before processing k_(m) _(k) _(−m) _(nq) ⁻¹. If k_(m) _(k) −m _(nq) ⁻¹ is zero, no addition operations are needed and therefore no invalid double could occur. On the other hand, if k_(m) _(k) _(−m) _(nq) ⁻¹ is one and the partial values of k_(tmp)=(k_(m) _(k) ⁻¹, . . . , k_(m) _(k) _(−m) _(nq) ,0)₂ are equally distributed, the probability that k_(tmp)≡k_(m) _(k) _(−m) _(nq) ⁻¹ mod n_(q) is approximately 1/n_(q). Given that m_(k)−m_(nq) bits are processed and that the probability of avoiding a point double for each processed nonzero bit is (1−1/n_(q)), the probability of successfully avoiding invalid point double operations can be also approximated with the expression show in Equation (9). Pr1=(1−1/n _(q))^((m) ^(k) ^(−m) ^(nq) ^()*Pr(k) ^(i) ^(≠0))  (9)

Equation (10) shows an expression for the probability of encountering an addition chain that avoids both multiples of n_(q) and values that would lead to invalid point doubles in projections into E_(q). Using an analysis similar to the one shown above, it can be shown that for each nonzero bit k_(i) for i∈[0,m_(k)−m_(nq)) two failure cases can be encountered: one case corresponds to a multiple of n_(q) and the other case corresponds to a value that would lead to an invalid point double. These conditions are mutually exclusive when n_(q) is an odd prime, and therefore, the aggregate probability of encountering either of these cases is approximately 2/n_(q). Given that m_(k)−m_(nq) bits are processed and that the probability of avoiding both undesirable cases for each processed nonzero bit is (1−2/n_(q)), the probability of encountering an addition chain that avoids both conditions can be approximated with the expression show in Equation (10). Pr2=(1−2/n _(q))^((m) ^(k) ^(−m) ^(nq) ^()*Pr(k) ^(i) ^(≠0))  (10)

Equation (11) and Equation (12) show general expressions of Equation (9) and Equation (10) for the fixed-window point multiplication algorithm, of which the classical double and add algorithm is the special case for which w=1. In these equations, m_(k)=┌log₂ _(w) k┐, m_(nq)=└log₂ _(w) n_(q)┘, Pr(k_(i)≠0)=(2^(w)−1)/2^(w) (note that one of the possible 2^(w) values of k_(i) is zero), and k=(k_(m) _(k) ⁻¹, . . . , k₁,k₀)₂ _(w) . Pr3=(1−1/n _(q))^((m) ^(k) ^(−m) ^(nq) ^()*Pr(k) ^(i) ^(≠0))  (11) Pr4=(1−2/n _(q))^((m) ^(k) ^(−m) ^(nq) ^()*Pr(k) ^(i) ^(≠0))  (12)

FIG. 10 and FIG. 11 each show tabulated simulation results of a recoding RPM algorithm according to the invention. The table in FIG. 10 summarizes recoding results for all values of k in the range [1,2¹⁶). The table in FIG. 11 shows results of 2¹⁶ random values of k in the range [1,2¹⁹²). These tables show measured probabilities, estimated probabilities based on Equation 12, and the estimation error. The tables show that the estimation error is low, especially for large values of n_(q). The results in the tables show that the probability of obtaining an addition chain from Algorithm 4 that requires no adjustment increases as the value n_(q) increases and it also increases as the window size (w) increases.

RPM Algorithm Complexity

When n_(q)>(2^(w+1)+1(2^(w)−1), cases 7, 9, and 10 of FIG. 8A are avoided. When these cases are avoided, an adjustment due to an invalid double operation is absorbed when processing the next digit, for example, as demonstrated in cases 6 and 8. An adjustment due to a found multiple of n_(q) is propagated if the next digit in the addition chain is zero, as in case 4; otherwise, the next digit absorbs the adjustment, as in case 5.

Equation 13 shows an expression for the expected adjustment propagation length due to multiples of n_(q). This equation accounts for intervening runs of zero digits terminated by nonzero digits. The worse case propagation occurs when a multiple of n_(q) is found early in the chain and it is propagated for m_(k)−m_(nq) digits, a case that is very unlikely for large k. E1=2^(w)/(2^(w)−1)  (13)

When the probability of adjustment is low, the additional overhead due to adjustments can be considered to be negligible. In these cases the complexity of the point multiplication with adjustment can be approximated by the complexity of point multiplication without adjustment. Equation 14 approximates the complexity of the point multiplication operation. In this equation, D represents the complexity of a point double, A represents the complexity of a point addition, and m represents the number of bits of k. Equation 15 provides an approximation for the number of bits required to store the pre-computed values. This expression assumes the storage of two coordinates per point. In comparison with Algorithm 4, Algorithm 5 includes the storage of one extra point. #OPs=mD+(┌m/w┐(2^(w)−1)/2^(w))A  (14) #MBs=m2^(w+1)  (15)

The most complex operations of the RPM algorithms are the two point multiplications. Of these, the point multiplication in E_(n) is the most complex. The point multiplication in E_(n) is of the order O((log₂ n/log₂ q)³) times more complex than the point multiplication in E_(q). This expression accounts for the square complexity of multiplications and the linear complexity of point multiplication (k vs. k mod n_(q)).

CONCLUSIONS

This disclosure introduces two methods for the reliable computation of point additions and point multiplications. For point multiplication, one embodiment of an unsigned fixed-window algorithm is disclosed. Those skilled in the art will recognize that the same principles employed in this algorithm can be extended to other point multiplication algorithms. The basic idea is to use a classical point multiplication algorithm and to adjust the addition chains that it generates so that they avoid invalid operations.

The RPA and RPM methods disclosed herein rely on asymmetric operations. For typical cases, the reliability of an ECC operation must be known. Rather than performing the ECC operation twice to ensure reliability (i.e. symmetric or redundant operation), two asymmetric operations are performed: one of the operations is of slightly higher complexity than the ECC operation, and the other operation is much simpler. The complexity of each operation is a function of the expected, or desired, degree of reliability.

The complexity of the simpler operation can be further reduced in comparison with the complex operation, for example, by using fixed-point multiplication algorithms or by using the Montgomery trick that computes only the x coordinate of a point multiplication. In this last case, the y coordinate of the resulting point in E_(p) can be verified by checking that the resulting x and y coordinates satisfy the elliptic curve equation.

The validity of the algorithms disclosed herein has been verified with simulations, and the results of these simulations have also been disclosed. In short, the methods presented here provide a way to reliably compute ECC operations with much lower complexity than fully redundant methods. And while various embodiments of the invention have been described, it will be apparent to those of ordinary skill in the art that many more embodiments and implementations are possible that are within the scope of this invention. Accordingly, the invention is not to be restricted except in light of the attached claims and their equivalents. 

1. In a computer system, a method for validating a computation involving one or more points on a specified elliptic curve, E_(p), comprising: selecting a second elliptic curve, E_(q); deriving a third elliptic curve, E_(n), from E_(p) and E_(q); projecting one or more points Pj_(n) onto E_(n), each point Pj_(n) a projection of a set of points [Pj_(p), Pj_(q)] where Pj_(p)∈E_(p), Pj_(q)∈E_(q), and j=1 to t (t an integer); performing a computation on E_(n) involving the one or more projected points Pj_(n); performing a computation on E_(q) involving one or more points Pj_(q); extracting, from the computation on E_(n), a predicted result of the computation on E_(q); and comparing the predicted result to an actual result of the computation on E_(q).
 2. The method of claim 1 further comprising: extracting, from the computation on E_(n), a predicted result of the computation to be validated; and if the predicted result of the computation on E_(q) equals the actual result of the computation on E_(q); validating the result predicted in the second extracting step.
 3. The method of claim 1 wherein at least one of elliptic curves E_(p) and E_(q) is defined over a prime field.
 4. The method of claim 1 wherein at least one of elliptic curves E_(p) and E_(q) is defined over a ring.
 5. The method of claim 3 or 4 wherein the elliptic curves are composed by a set of points (x,y) that satisfies an elliptic curve equation together with a point at infinity.
 6. The method of claim 5 wherein the equation is y²≡x³+a_(p)x+b_(p) mod p, where a and b are constants, and where p is a prime number greater than
 3. 7. The method of claim 1 wherein curves E_(p) and E_(q) are defined over prime fields F_(p) and F_(q), respectively; E_(n) is defined over a ring Z_(n); p and q are coprime; and n=pq.
 8. The method of claim 1 wherein E_(p) and E_(q) are defined by elliptic curve equations of similar form, and E_(n) is derived from E_(p) and E_(q) by means of Chinese Remainder Theorem.
 9. The method of claim 1 wherein the one or more resultant points Pj_(n) are derived by means of Chinese Remainder Theorem.
 10. The method of claim 1 wherein the computation to be verified comprises a point addition.
 11. The method of claim 10 wherein the point addition comprises Q_(p)=P_(1p)+P_(2p), where P_(1p), P_(2p) are elements of E_(p).
 12. The method of claim 11 wherein the computation on E_(q) comprises a point addition Q_(q)=P_(1q)+P_(2q), where P_(1q), P_(2q) are elements of E_(q).
 13. The method of claim 12 wherein the computation on E_(n) comprises a point addition Q_(n)=P_(1n)+P_(2n), where P_(1n)=[P_(1p), P_(1q)], P_(2n)=[P_(2p), P_(2q)] are elements of E_(n).
 14. The method of claim 1 wherein Q′_(q), the predicted result of the computation on E_(q), is extracted according to the equation Q′ _(q)=(x _(Q′q) ≡x _(Qn) mod q, y _(Q′q) ≡y _(Qn) mod q), wherein curves E_(p), E_(q), E_(n) use arithmetic modulo p, q and n, respectively, where p and q are coprime numbers greater than 3, and where n=pq.
 15. The method of claim 2 wherein Q′_(p), the predicted result of the computation to be validated, is extracted according to the equation Q′p=(x _(Q′p) ≡x _(Qn) mod p, y _(Q′p) ≡y _(Qn) mod p), wherein curves E_(p), E_(q), E_(n) use arithmetic modulo p, q and n, respectively, where p and q are coprime numbers greater than 3, and where n=pq.
 16. A processor readable medium tangibly embodying any of the methods of claims 1 to 15 as a series of software instructions.
 17. The medium of claim 15 selected from the group comprising RAM, ROM, PROM, EPROM, EEPROM, disk, floppy disk, hard disk, CD-ROM, DVD and flash memory.
 18. A logic device configured to execute any of the methods of claims 1 to
 15. 19. The device of claim 18 selected from the group comprising embedded computer, integrated circuit, customized gate array, FPGA, and ASIC.
 20. In an elliptic curve cryptosystem, a method for validating a computation involving one or more points on a specified elliptic curve, E_(p), using multiple elliptic validation curves E_(q), comprising: selecting m elliptic validation curves E_(qi), where i=1 to m (m an integer), each curve E_(qi) comprising one or more validation subgroups; deriving an elliptic curve E_(n) from the specified curve E_(p) and the m validation curves E_(qi); projecting one or more points Pj_(n) onto E_(n), each point Pj_(n) a projection of a set of points [Pj_(p), Pj_(qi)]=[Pj_(p), Pj_(q1), Pj_(q2), . . . . Pj_(qm)], where Pj_(P)∈E_(p), Pj_(qi)∈E_(qi), and j=1 to m; performing a computation on E_(n) involving the one or more projected points Pj_(n); performing a computation on each validation curve E_(qi), each computation involving one or more points Pj_(qi) on each curve E_(qi), respectively; extracting, from the computation on E_(n), a predicted result for each validation curve computation; and comparing each predicted result to its corresponding actual result obtained from the validation curve computation.
 21. The method of claim 20 further comprising: extracting, from the computation on E_(n), a predicted result of the computation to be validated; and if each predicted result for a validation curve computation equals its corresponding actual result; validating the result predicted in the second extracting step.
 22. The method of claim 20 wherein at least one of the elliptic curves E_(p) and E_(q) is defined over a prime field.
 23. The method of claim 20 wherein at least one of the elliptic curves E_(p) and E_(q) is defined over a ring.
 24. The method of claim 22 or 23 wherein the elliptic curves are composed by a set of points (x,y) that satisfies an elliptic curve equation together with a point at infinity.
 25. The method of claim 24 wherein the equation is y²≡x³+a_(p)x+b_(p) mod p, where a and b are constants, and where p is a prime number greater than
 3. 26. The method of claim 20 wherein at least one subgroup in E_(qi) has a number of points that is prime.
 27. The method of claim 20 wherein at least one validation subgroup in curve E_(qi) has a number of points that is coprime to a number of points in any other validation subgroup in curves E_(q).
 28. The method of claim 20 wherein each validation subgroup in curve E_(qi) has a number of points that is coprime to a number of points in any other validation subgroup in curves E_(q).
 29. The method of claim 20 wherein curves E_(p) and E_(qi), are defined over finite fields of integers modulo p and q_(i), respectively; E_(n) is defined over a ring; p and all qi are coprime numbers greater than 3; and n=pq₁q₂ . . . q_(m).
 30. The method of claim 20 wherein E_(n) is derived from E_(p) and E_(qi) for i=1 to m by means of Chinese Remainder Theorem.
 31. The method of claim 20 wherein the one or more resultant points Pj_(n) are derived by means of Chinese Remainder Theorem.
 32. The method of claim 20 wherein the computation to be verified comprises a point addition.
 33. The method of claim 32 wherein the point addition comprises Q_(p)=P_(1p)+P_(2p)+ . . . P_(jp), where P_(1p), P_(2p) . . . Pj_(p) are elements of E_(p).
 34. The method of claim 20 wherein the computation on each E_(qi) comprises a point addition Q_(qi)=P_(1qi)+P_(2qi)+ . . . +Pj_(qi), where P_(1qi), P_(2qi) . . . Pj_(qi) are elements of E_(qi).
 35. The method of claim 20 wherein the computation on E_(n) comprises a point addition Q_(n)=P_(1n)+P_(2n)+ . . . +P_(tn), where P_(1n)=[P_(1p), P_(1q1), P_(1q2), . . . P_(1qm)], P_(2n)=[P_(2p), P_(2q1), P_(2q2), . . . P_(2qm)] . . . P_(tn)=[P_(tp), P_(tq1), P_(tq2), . . . P_(tqm)] are elements of E_(n).
 36. The method of claim 20 wherein each predicted result, Q′_(qi), is extracted according to the equation Q′ _(qi)=(x _(Q′qi) ≡x _(Qn) mod qi, y _(Q′qi) ≡y _(Qn) mod qi), wherein curves E_(p), E_(qi), E_(n) use arithmetic modulo p, qi and n, respectively, where p and all qi are coprime numbers greater than 3, and where n=pq₁q₂ . . . q_(m).
 37. The method of claim 36 wherein at least one subgroup in E_(qi) has a number of points that is prime.
 38. The method of claim 36 wherein at least one validation subgroup in curve E_(qi) has a number of points that is coprime to a number of points in any other validation subgroup in curves E_(q).
 39. The method of claim 36 wherein each validation subgroup in curve E_(qi) has a number of points that is coprime to a number of points in any other validation subgroup in curves E_(q).
 40. The method of claim 20 wherein the predicted result of the computation to be validated, Q′_(p), is extracted according to the equation Q′ _(p)=(x _(Q′p) ≡x _(Qn) mod p, y _(Q′p) ≡y _(Qn) mod p), wherein curves E_(p), E_(qi), E_(n) use arithmetic modulo p, qi and n, respectively, where p and all qi are coprime numbers greater than 3, and where n=pq₁q₂ . . . q_(m).
 41. The method of claim 40 wherein at least one subgroup in E_(qi) has a number of points that is prime.
 42. The method of claim 40 wherein at least one validation subgroup in curve E_(qi) has a number of points that is coprime to a number of points in any other validation subgroup in curves E_(q).
 43. The method of claim 40 wherein each validation subgroup in curve E_(qi) has a number of points that is coprime to a number of points in any other validation subgroup in curves E_(q).
 44. A processor readable medium tangibly embodying any of the methods of claims 20 to 43 as a series of software instructions.
 45. The medium of claim 44 selected from the group comprising RAM, ROM, PROM, EPROM, EEPROM, disk, floppy disk, hard disk, CD-ROM, DVD and flash memory.
 46. A logic device configured to execute any of the methods of claims 20 to
 43. 47. The device of claim 46 selected from the group comprising embedded computer, integrated circuit, customized gate array, FPGA, and ASIC.
 48. The method of claim 1 or 20 wherein the computation to be validated comprises point subtractions.
 49. In a computing system using elliptic curve cryptography, a method for validating a point multiplication kP_(p) on a specified elliptic curve E_(p) defined over a prime field, where k is an integer and P_(p) is a point in E_(p), comprising: selecting m elliptic validation curves E_(qi), where i=1 to m (m an integer); deriving an elliptic curve E_(n) from the specified curve E_(p) and the m validation curves E_(qi); projecting one or more points Pj_(n) onto E_(n), each point Pj_(n) a projection of a set of points [Pj_(p), Pj_(qi)]≡[Pj_(p), Pj_(q1), Pj_(q2), . . . Pj_(qm)], where Pj_(p)∈E_(p), Pj_(qi)∈E_(qi), and j=1 to m; generating an addition chain for k that avoids invalid points; computing a point multiplication Q_(n)=kPj_(n) for Pj_(n) on curve E_(n); computing point multiplications Q_(qi)=kPj_(qi) for each Pj_(qi) on each curve E_(qi), respectively; extracting, from the computation on E_(n), a predicted result for each computation on a curve E_(qi); and comparing each predicted result to its corresponding actual result obtained from the computation on E_(qi).
 50. The method of claim 49 wherein computing point multiplications Q_(qi)=kPj_(qi) further comprises using (k mod n_(qi))Pj_(qi), where n_(qi) represents the number of points in the validation subgroup of E_(qi).
 51. The method of claim 49 further comprising: extracting, from the computation on E_(n), a predicted result for kP_(p); and if each predicted result for a computation on a curve E_(qi) equals its corresponding actual result; validating the result predicted in the second extracting step.
 52. The method of claim 49 wherein each curve E_(qi) comprises one or more validation subgroups.
 53. The method of claim 52 wherein at least one subgroup in the m validation curves E_(qi) has a number of points that is prime.
 54. The method of claim 52 wherein at least one validation subgroup in the m validation curves E_(qi) has a number of points that is coprime to a number of points in any other validation subgroup.
 55. The method of claim 52 wherein each validation subgroup in the m validation curves E_(qi) has a number of points that is coprime to a number of points in any other validation subgroup.
 56. The method of claim 49 wherein each elliptic curve comprises a set of points (x,y) that satisfies an elliptic curve equation together with a point at infinity.
 57. The method of claim 56 wherein the equation is y²≡x³+a_(p)x+b_(p) mod p, where a and b are constants, and where p is a prime number greater than
 3. 58. The method of claim 49 wherein curves E_(p) and E_(qi) are defined over finite fields of integers modulo p and q_(i), respectively; E_(n) is defined over a ring; p and all q_(i) are prime numbers greater than 3; and n=pq₁q₂ . . . q_(m).
 59. The method of claim 49 wherein E_(n) is derived by means of Chinese Remainder Theorem.
 60. The method of claim 49 wherein the one or more resultant points Pj_(n) are derived by means of Chinese Remainder Theorem.
 61. The method of claim 49 wherein the addition chain avoids intermediate points iP_(n), where i is a multiple of n_(qi) or n_(p); n_(qi) represents a number of points in E_(qi); and n_(p) represents a number of points in E_(p).
 62. The method of claim 49 wherein the addition chain avoids point additions that project to point doubles in either E_(p) or E_(q).
 63. The method of claim 49 wherein each predicted result, Q′_(qi), is extracted according to the equation Q′ _(qi)=(x _(Q′qi) ≡x _(Qn) mod qi, y _(Q′qi) ≡y _(Qn) mod qi), wherein curves E_(p), E_(qi), E_(n) use arithmetic modulo p, qi and n, respectively, where p and all qi are coprime numbers greater than 3, and where n=pq₁q₂ . . . q_(m).
 64. The method of claim 49 wherein the predicted result of the computation to be validated, Q′_(p), is extracted according to the equation Q′ _(p)=(x _(Q′p) ≡x _(Qn) mod p, y _(Q′p) ≡y _(Qn) mod p), wherein curves E_(p), E_(qi), E_(n) use arithmetic modulo p, qi and n, respectively, where p and all qi are coprime numbers greater than 3, and where n=pq₁q₂ . . . q_(m).
 65. A processor readable medium tangibly embodying any of the methods of claims 49 to 64 as a series of software instructions.
 66. The medium of claim 65 selected from the group comprising RAM, ROM, PROM, EPROM, EEPROM, disk, floppy disk, hard disk, CD-ROM, DVD and flash memory.
 67. A logic device configured to execute any of the methods of claims 49 to
 64. 68. The device of claim 67 selected from the group comprising embedded computer, integrated circuit, customized gate array, FPGA, and ASIC. 